криптографически случайный
Последовательность называется криптографически случайной, если ее следующий элемент вычислительно невозможно предсказать, даже зная алгоритм генерации этой последовательности и все ее предшествующие элементы.
[http://www.rfcmd.ru/glossword/1.8/index.php?a=index&d=23]
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
Cryptographic engineering — is the discipline of using cryptography to solve human problems. Cryptography is typically applied when trying to ensure data confidentiality, to authenticate people or devices, or to verify data integrity in risky environments. Cryptographic… … Wikipedia
Random self-reducibility — (RSR): A good algorithm for the average case implies a good algorithm for the worst case. RSR is the ability to solve all instances of a problem by solving a large fraction of the instances.DefinitionIf a function f evaluating any instance x can… … Wikipedia
Cryptographic primitive — Cryptographic primitives are well established, low level cryptographic algorithms that are frequently used to build computer security systems. These routines include, but are not limited to, one way hash functions and encryption functions.… … Wikipedia
Random number table — Random number tables have been used in statistics for tasks such as selected random samples. This was much more effective than manually selecting the random samples (with dice, cards, etc.). Nowadays, tables of random numbers have been replaced… … Wikipedia
Cryptographic hash function — A cryptographic hash function (specifically, SHA 1) at work. Note that even small changes in the source input (here in the word over ) drastically change the resulting output, by the so called avalanche effect. A cryptographic hash function is a… … Wikipedia
Random number generator attack — The security of cryptographic systems depends on some secret data that is known to authorized persons but unknown and unpredictable to others. To achieve this unpredictability, some randomization is typically employed. Modern cryptographic… … Wikipedia
Random oracle — In cryptography, a random oracle is an oracle (a theoretical black box) that responds to every query with a (truly) random response chosen uniformly from its output domain, except that for any specific query, it responds the same way every time… … Wikipedia
Random number generation — A random number generator (often abbreviated as RNG) is a computational or physical device designed to generate a sequence of numbers or symbols that lack any pattern, i.e. appear random. Computer based systems for random number generation are… … Wikipedia
Random password generator — A random password generator is software program or hardware device that takes input from a random or pseudo random number generator and automatically generates a password. Random passwords can be generated manually, using simple sources of… … Wikipedia
Random function — A random function is a function chosen at random from a finite family of functions. Typically, the family consists of the set of all maps from the domain to the image set. Thus, a random function can be considered to map each input independently… … Wikipedia
Cryptographic key types — One of the most important aspects of any cryptographic system is key management; it is also the aspect which is most often neglected.[citation needed] A very common mistake is mixing different key types and reusing the same key for different… … Wikipedia
